首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10302篇
  免费   957篇
  国内免费   1179篇
化学   669篇
晶体学   5篇
力学   387篇
综合类   211篇
数学   8631篇
物理学   2535篇
  2023年   101篇
  2022年   103篇
  2021年   182篇
  2020年   233篇
  2019年   280篇
  2018年   269篇
  2017年   290篇
  2016年   315篇
  2015年   220篇
  2014年   457篇
  2013年   767篇
  2012年   429篇
  2011年   551篇
  2010年   539篇
  2009年   769篇
  2008年   728篇
  2007年   800篇
  2006年   675篇
  2005年   587篇
  2004年   484篇
  2003年   522篇
  2002年   507篇
  2001年   346篇
  2000年   388篇
  1999年   353篇
  1998年   305篇
  1997年   265篇
  1996年   167篇
  1995年   120篇
  1994年   91篇
  1993年   67篇
  1992年   52篇
  1991年   49篇
  1990年   28篇
  1989年   37篇
  1988年   39篇
  1987年   23篇
  1986年   16篇
  1985年   34篇
  1984年   31篇
  1983年   17篇
  1982年   30篇
  1981年   26篇
  1980年   26篇
  1979年   15篇
  1978年   17篇
  1977年   12篇
  1976年   14篇
  1973年   10篇
  1971年   10篇
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
1.
This paper is devoted to the construction of weak solutions to the singular constant Q-curvature problem. We build on several tools developed in the last years. This is the first construction of singular metrics on closed manifolds of sufficiently large dimension with constant (positive) Q-curvature.  相似文献   
2.
3.
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.  相似文献   
4.
We prove a well-posedness result for two pseudo-parabolic problems, which can be seen as two models for the same electrical conduction phenomenon in heterogeneous media, neglecting the magnetic field. One of the problems is the concentration limit of the other one, when the thickness of the dielectric inclusions goes to zero. The concentrated problem involves a transmission condition through interfaces, which is mediated by a suitable Laplace-Beltrami type equation.  相似文献   
5.

The machining process is primarily used to remove material using cutting tools. Any variation in tool state affects the quality of a finished job and causes disturbances. So, a tool monitoring scheme (TMS) for categorization and supervision of failures has become the utmost priority. To respond, traditional TMS followed by the machine learning (ML) analysis is advocated in this paper. Classification in ML is supervised based learning method wherein the ML algorithm learn from the training data input fed to it and then employ this model to categorize the new datasets for precise prediction of a class and observation. In the current study, investigation on the single point cutting tool is carried out while turning a stainless steel (SS) workpeice on the manual lathe trainer. The vibrations developed during this activity are examined for failure-free and various failure states of a tool. The statistical modeling is then incorporated to trace vital signs from vibration signals. The multiple-binary-rule-based model for categorization is designed using the decision tree. Lastly, various tree-based algorithms are used for the categorization of tool conditions. The Random Forest offered the highest classification accuracy, i.e., 92.6%.

  相似文献   
6.
7.
8.
在p-adic域上研究分数次Hardy型算子与CMO(Q_p~n)函数生成的多线性交换子,建立了交换子在Lebesgue空间和Herz空间上的有界性.对Hardy算子的多线性交换子也得到了相应的结果.  相似文献   
9.
Let x=(x',x')with x'∈Rk and x'∈R^N-k andΩbe a x'-symmetric and bounded domain in R^N(N≥2).We show that if 0≤a≤k-2,then there exists a positive constant C>0 such that for all x'-symmetric function u∈C0^∞(Ω)with∫Ω|■u(x)|^N-a|x'|^-adx≤1,the following uniform inequality holds1/∫Ω|x|^-adx∫Ωe^βa|u|N-a/N-a-1|x'|^-adx≤C,whereβa=(N-a)(2πN/2Γ(k-a/2)Γ(k/2)/Γ(k/2)r(N-a/2))1/N-a-1.Furthermore,βa can not be replaced by any greater number.As the application,we obtain some weighted Trudinger–Moser inequalities for x-symmetric function on Grushin space.  相似文献   
10.
We consider the random‐cluster model (RCM) on with parameters p∈(0,1) and q ≥ 1. This is a generalization of the standard bond percolation (with edges open independently with probability p) which is biased by a factor q raised to the number of connected components. We study the well‐known Fortuin‐Kasteleyn (FK)‐dynamics on this model where the update at an edge depends on the global geometry of the system unlike the Glauber heat‐bath dynamics for spin systems, and prove that for all small enough p (depending on the dimension) and any q>1, the FK‐dynamics exhibits the cutoff phenomenon at with a window size , where λ is the large n limit of the spectral gap of the process. Our proof extends the information percolation framework of Lubetzky and Sly to the RCM and also relies on the arguments of Blanca and Sinclair who proved a sharp mixing time bound for the planar version. A key aspect of our proof is the analysis of the effect of a sequence of dependent (across time) Bernoulli percolations extracted from the graphical construction of the dynamics, on how information propagates.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号